SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition

We explore efficient optimization of toolpaths based on multiple criteria for large instances 3D printing problems. first show that the minimum turn cost problem is NP-hard, even when region a simple polygon. develop SFCDecomp, space filling curve decomposition framework to solve problems efficiently by solving these subproblems independently. For Buddha model, our builds over total 799,716 nodes across 169 layers, and Bunny model it 812,733 360 layers. Building we multicriteria approach toolpath planning. demonstrate utility maximizing or minimizing tool path edge overlap between adjacent while jointly costs. Strength testing tensile test specimen printed with paths maximize minimize layer overlaps reveal significant differences in strength two classes prints.